Two discrete inequalities of Gr"uss type via P'olya-Szeg"o and Shisha-Mond results for real numbers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deriving Fuzzy Inequalities Using Discrete Approximation of Fuzzy Numbers

Most of the researches in the domain of fuzzy number comparisons serve the fuzzy number ordering purpose. For making a comparison between two fuzzy numbers, beyond the determination of their order, it is needed to derive the magnitude of their order. In line with this idea, the concept of inequality is no longer crisp however it becomes fuzzy in the sense of representing partial belonging or de...

متن کامل

Payne-polya-weinberger Type Inequalities for Eigenvalues of Nonelliptic Operators

Let denote the Laplacian in the Euclidean space. The classic upper estimates, independent of the domain, for the gaps of eigenvalues of − , (− )2 and (− )k(k ≥ 3) were studied extensively by many mathematicians, cf. Payne, Polya and Weinberger [16], Hile and Yeh [10], Chen and Qian [2], Guo [8] etc.. The asymptotic behaviors of eigenvalues for degenerate elliptic operators were considered by Be...

متن کامل

deriving fuzzy inequalities using discrete approximation of fuzzy numbers

most of the researches in the domain of fuzzy number comparisons serve the fuzzy number ordering purpose. for making a comparison between two fuzzy numbers, beyond the determination of their order, it is needed to derive the magnitude of their order. in line with this idea, the concept of inequality is no longer crisp however it becomes fuzzy in the sense of representing partial belonging or de...

متن کامل

Narayana numbers and Schur-Szego composition

In the present paper we find a new interpretation of Narayana polynomials Nn(x) which are the generating polynomials for the Narayana numbers Nn,k = 1 n C k−1 n C k n where C i j stands for the usual binomial coefficient, i.e. C j = j! i!(j−i)! . They count Dyck paths of length n and with exactly k peaks, see e.g. [13] and they appeared recently in a number of different combinatorial situations...

متن کامل

Data Type for Real Numbers . ⋆

We present a calculus having real numbers as a basic data type. The calculus is defined by its denotational semantics. We prove the universality of the calculus. We show how the definition of an operational semantics is problematic. We discuss this problem and present a possible solution.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tamkang Journal of Mathematics

سال: 2004

ISSN: 2073-9826,0049-2930

DOI: 10.5556/j.tkjm.35.2004.213